Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
نویسندگان
چکیده
منابع مشابه
Isotropic Constant Dimension Subspace Codes
In network code setting, a constant dimension code is a set of k-dimensional subspaces of F nq . If F_q n is a nondegenerated symlectic vector space with bilinear form f, an isotropic subspace U of F n q is a subspace that for all x, y ∈ U, f(x, y) = 0. We introduce isotropic subspace codes simply as a set of isotropic subspaces and show how the isotropic property use in decoding process, then...
متن کاملMinimum Distance of Binary Nonlinear Codes∗
A binary nonlinear code can be represented as the union of cosets of a binary linear subcode. Using this representation, new algorithms methods to compute the minimum Hamming weight and distance are presented. The performance of these algorithms is also studied.
متن کاملConstruction of Large Constant Dimension Codes with a Prescribed Minimum Distance
In this paper we construct constant dimension space codes with prescribed minimum distance. There is an increased interest in space codes since a paper [13] by Kötter and Kschischang were they gave an application in network coding. There is also a connection to the theory of designs over finite fields. We will modify a method of Braun, Kerber and Laue [7] which they used for the construction of...
متن کاملSome new distance-4 constant weight codes
Improved binary constant weight codes with minimum distance 4 and length at most 28 are constructed. A table with bounds on the chromatic number of small Johnson graphs is given.
متن کاملLower bounds on the minimum average distance of binary codes
Let β(n,M) denote the minimum average Hamming distance of a binary code of length n and cardinality M. In this paper we consider lower bounds on β(n,M). All the known lower bounds on β(n,M) are useful when M is at least of size about 2n−1/n. We derive new lower bounds which give good estimations when size of M is about n. These bounds are obtained using linear programming approach. In particula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2018
ISSN: 0925-1022,1573-7586
DOI: 10.1007/s10623-018-0544-8